An existence theorem for optimal stochastic programming
نویسندگان
چکیده
منابع مشابه
An Ergodic Theorem for Stochastic Programming Problems?
To justify the use of sampling to solve stochastic programming problems one usually relies on a law of large numbers for random lsc (lower semicontinuous) functions when the samples come from independent, identical experiments. If the samples come from a stationary process, one can appeal to the ergodic theorem proved here. The proof relies on thèscalarization' of random lsc functions.
متن کاملAn Existence Theorem for Optimal Control Systems with State Variable in C, and Stochastic Control Problems
We consider an existence theorem for controi systems whose state variables for every t are in C, the set of continuous functions varying over a given set L The dependence of the state variables upon a ~ / i s induced by their dependence upon the initial state and the state equation governing the system. In contrast, the control u ---u(t) is taken as a measurable function of t alone. The usual s...
متن کاملAn Equilibrium Existence Theorem
Bewley 14, Theorem l] proved an infinite dimensional equilibrium existence theorem which is a significant extension of the classical finite dimensional theorem of Arrow and Debreu [ 11. The assumptions on technology and preferences are natural and applicable in a wide variety of cases. The proof is based on a limit argument that makes direct use of the existence of equilibrium in the finite dim...
متن کاملA Unified Existence and Uniqueness Theorem for Stochastic Evolution Equations
An existence and uniqueness theorem for mild solutions of stochastic evolution equations is presented and proved. The diffusion coefficient is handled in a unified way which allows a unified theorem to be formulated for different cases, in particular, of multiplicative space–time white noise and trace-class noise. 2000 Mathematics subject classification: primary 60H15; secondary 35K90.
متن کاملAn Optimal Alternative Theorem and Applications to Mathematical Programming
Given a closed convex cone P with nonempty interior in a locally convex vector space, and a set A ⊂ Y , we provide various equivalences to the implication A ∩ (−int P ) = ∅ =⇒ co(A) ∩ (−int P ) = ∅, among them, to the pointedness of cone(A + int P ). This allows us to establish an optimal alternative theorem, suitable for vector optimization problems. In addition, we characterize the two-dimens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1968
ISSN: 0004-9735
DOI: 10.1017/s1446788700004651